Content-Based Multicast: Comparison of Implementation Options
نویسنده
چکیده
This paper is an attempt to quantify the performance differences for content-based multicast implemented inside the overlay routing algorithm or built on top of the simple API provided by the routing layer. We focus on overlay networks designed for peer-to-peer distributed hash table (DHT) applications where content-based multicast is most applicable. In particular we study the Content Addressable Networks (CAN) and Chord routing algorithms. It is our conjecture that similar results would be obtained through other protocols such as Pastry and Tapestry. We show that it is feasible and in some ways more flexible to provide content-based multicast above the routing layer with only a modest gain in latency.
منابع مشابه
A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملmMOM: Efficient Mobile Multicast Support Based on the Mobility of Mobile Hosts
The IETF Mobile IP is the dominant standard for IP mobility support and defines two multicast options for providing multicast to mobile hosts (MHs): remote subscription (RS) and bi-directional tunneling (BT). Since the two options have complementary advantages, improved multicast support can be achieved by combining the two options. In this paper, in order to synthesize the strong points of the...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملSemantically Reliable Multicast: Definition, Implementation, and Performance Evaluation
Semantic Reliability is a novel correctness criterion for multicast protocols based on the concept of message obsolescence: A message becomes obsolete when its content or purpose is superseded by a subsequent message. By exploiting obsolescence, a reliable multicast protocol may drop irrelevant messages to find additional buffer space for new messages. This makes the multicast protocol more res...
متن کاملClassification and Evaluation of Multicast-Based Mobility Support in All-IP Cellular Networks
To solve the IP mobility problem the use of multicast has been proposed in a number of different approaches, applying multicast in different characteristic ways. In this paper we provide a framework to classify such approaches by analyzing requirements, options for using multicast protocols, and mobility functionalities augmenting the multicast. Within this framework we identify promising combi...
متن کامل